Primitive Illumination Systems for Families of Convex Bodies in the Plane

نویسنده

  • Valeriu Soltan
چکیده

Let F = fC 1 ; C 2 ; : : : ; C n g be a family of n disjoint convex bodies in the plane. We say that a set V of exterior light sources illuminates F, if for every boundary point u of any member of F there is a point v in V such that u is visible from v, i.e. the open line segment joining u and v is disjoint from F. An illumination system V is called primitive if no 1 2 Valeriu Soltan, LL aszll o Szabb o, Eva VV ass arhelyi proper subset of V illuminates F. Let p max (F) denote the maximum number of points forming a primitive illumination system for F, and let p max (n) denote the minimum of p max (F) taken over all families F consisting of n disjoint convex bodies in the plane. The aim of this paper is to investigate the quantities p max (F) and p max (n).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Survey Paper Combinatorial problems on the illumination of convex bodies

This is a review of various problems and results on the illumination of convex bodies in the spirit of combinatorial geometry. The topics under review are: history of the Gohberg–Markus–Hadwiger problem on the minimum number of exterior sources illuminating a convex body, including the discussion of its equivalent forms like the minimum number of homothetic copies covering the body; generalizat...

متن کامل

On the successive illumination parameters of convex bodies

The notion of successive illumination parameters of convex bodies is introduced. We prove some theorems in the plane and determine the exact values of the successive illumination parameters of spheres, cubes and crosspolytopes for some dimensions.

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

The Covering Index of Convex Bodies

Covering a convex body by its homothets is a classical notion in discrete geometry that has resulted in a number of interesting and long-standing problems. Swanepoel [Mathematika 52 (2005), 47–52] introduced the covering parameter of a convex body as a means of quantifying its covering properties. In this paper, we introduce a relative of the covering parameter called covering index, which turn...

متن کامل

On the covering index of convex bodies

Covering a convex body by its homothets is a classical notion in discrete geometry that has resulted in a number of interesting and long-standing problems. Swanepoel introduced the covering parameter of a convex body as a means of quantifying its covering properties. In this paper, we introduce two relatives of the covering parameter called covering index and weak covering index, which upper bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997